Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra
نویسندگان
چکیده
منابع مشابه
Ray Shooting Amidst Fat Convex Polyhedra in 3-Space
We present a data structure for ray-shooting queries in a set of convex fat polyhedra of total complexity n in R. The data structure uses O(n) storage and preprocessing time, and queries can be answered in O(log n) time. A trade-off between storage and query time is also possible: for any m with n < m < n, we can construct a structure that uses O(m) storage and preprocessing time such that quer...
متن کاملShooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
We consider the problem of ray shooting in a three-dimensional scene consisting of m (possibly intersecting) convex polyhedra or polyhedral terrains with a total of n faces, i.e., we want to preprocess them into a data structure, so that the first intersection point of a query ray and the given polyhedra can be determined quickly. We present a technique that requires O ((mn):+) preprocessing ti...
متن کاملRay Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
We consider the problem of ray shooting in a 3-dimensional scene consisting of m (possibly intersecting) convex polyhedra or polyhedral terrains with a total of n faces, i.e., we want to preprocess them into a data structure, so that the rst intersection point of a query ray and the given polyhedra can be determined quickly. We present a technique that requires O((mn) 2+") preprocessing time an...
متن کامل3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain eecient and rather simple solutions to several problems including (i) vertical ray shooting | preprocess a set K of n non-intersecting convex simply-shaped at objects in 3-space, whose xy-projections are fat, for eecient vertical ray shooting queries, (ii) point enclosure | preproc...
متن کاملRay shooting from convex ranges
We consider geometric and graph-theoretic aspects of the well-known paradigm \killing two birds with one stone". Consider that we have a set X of n-points in space and a compact plane convex set S. We deene a graph G(X; S), called the ray shooting graph, on X as follows: The points of X are the vertices and fpi; pj g, pi; pj 2 X , is an edge if and only if the line joining pi to pj intersects S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2008
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-008-9220-0